/ ISAAC 2015 / 26th Symposium on Algorithms and Computation/ Dec.8ｰ11, 2015
Submission of Papers: The submission should contain a scholarly exposition of ideas, techniques, and results, including motivation and a comparison with related work. The main text, including title, abstract, and references, should not exceed 11 pages in LNCS style. An optional appendix should be used to provide proof details that do not fit in the main text. Submitted papers must describe unpublished work. Authors should not submit papers with the same results or essentially the same results that are accepted or published or under review by a conference with refereed proceedings or a journal. Only electronic submission will be allowed and only pdf files will be accepted. It will be done via Easychair:
https://www.easychair.org/conferences/?conf=isaac2015
At least one author of an accepted paper is expected to present the paper at the conference as a registered participant.

Submission Deadline: June 19, 2015 (Anywhere on Earth)
Notification of Acceptance: By August 31, 2015
Camera Ready Copy: September 21, 2015
Call for Papers
Publication:
The proceedings will be published by Springer-Verlag in the LNCS series. Selected papers will be invited to special issues of Algorithmica and International Journal of Computational Geometry and Applications.
Awards:
A Best Paper and a Best Student Paper may be awarded. A paper is eligible for the Best Student Paper Award if all authors are full-time students at the time of submission. To indicate that a submission is eligible, please add the phrase "Eligible for the Best Student Paper Award" in the abstract.

Topics: The topics include, but are not limited to:
Algorithmic game theory Algorithms and Data structures
Approximation algorithms Combinatorial optimization
Computational biology Computational complexity
Computational geometry Cryptography
Experimental algorithms Graph drawing and Graph algorithms
Internet algorithms Online algorithms
Quantum computing Randomized algorithms
Parallel and Distributed algorithms